Obtaining New Dividing Formulas n|Q(n) From the Known Ones
نویسنده
چکیده
In this note, we present a few methods (Theorems 1, 2, and 3) from discrete dynamical systems theory of obtaining new functions Q(n) from the known ones so that the dividing formulas n|Q(n) hold.
منابع مشابه
Bounds on $m_r(2,29)$
An $(n, r)$-arc is a set of $n$ points of a projective plane such that some $r$, but no $r+1$ of them, are collinear. The maximum size of an $(n, r)$-arc in PG(2, q) is denoted by $m_r(2,q)$. In this paper thirteen new $(n, r)$-arc in PG(2,,29) and a table with the best known lower and upper bounds on $m_r(2,29)$ are presented. The results are obtained by non-exhaustive local computer search.
متن کاملTHE f(q) MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS
In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtaining formulas for Ne(n) (resp. No(n)), the number of partitions of n with even (resp. odd) rank. Thanks to Rademacher’s celebrated formula for the partition function, this problem is equivalent to that of obtaining a formula for the coefficients of the mock theta function f(q),...
متن کاملNew Large (n, r)-arcs in PG(2, q)
An $(n, r)$-arc is a set of $n$ points of a projective plane such that some $r$, but no $r+1$ of them, are collinear. The maximum size of an $(n, r)$-arc in $PG(2, q)$ is denoted by $m_r(2,q)$. In this paper we present a new $(184,12)$-arc in PG$(2,17),$ a new $(244,14)$-arc and a new $(267,15$)-arc in $PG(2,19).$
متن کاملTitle: Herbrand Consistency in Arithmetics with Bounded Induction
The language of arithmetical theories considered here is L = +, ×, ≤, 0, 1 in which the symbols are interpreted as usual in elementary mathematics. Robinson's arithmetic is denoted by Q; it is a finitely axiomatized basic theory of the function and predicate symbols in L. Peano's arithmetic PA is the first-order theory that extends Q by the induction schema for any L-formula ϕ(x): ϕ(0) & ∀x(ϕ(x...
متن کاملA Universal Investigation of $n$-representations of $n$-quivers
noindent We have two goals in this paper. First, we investigate and construct cofree coalgebras over $n$-representations of quivers, limits and colimits of $n$-representations of quivers, and limits and colimits of coalgebras in the monoidal categories of $n$-representations of quivers. Second, for any given quivers $mathit{Q}_1$,$mathit{Q}_2$,..., $mathit{Q}_n$, we construct a new quiver $math...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008